INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING
نویسندگان
چکیده
منابع مشابه
Informed Reactive Tabu Search for Graph Coloring
Tabu Search (TS) has always been a very popular algorithm for graph coloring, both as a stand-alone optimizer as well as a subroutine inside population-based hybrid methods. We present two TS extensions that could allow previous TS algorithms to improve their behavior at almost no additional computational cost. First, we integrate two new evaluation functions which employ supplementary (structu...
متن کاملReinforced Tabu Search for Graph Coloring
Tabu search (TS) [21] was first applied to graph coloring by Hertz and de Werra in 1987 [23]. Even today, the original Tabucol algorithm as well as its variants are among the best reference algorithms for general graph coloring. In this paper, we describe a Reinforced TS (RTS) coloring algorithm and show improved results on the well-established Dimacs challenge graphs. The improvement is essent...
متن کاملReactive Tabu Search for Measuring Graph Similarity
Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching, giving rise to different graph similarity measures. A first goal of this paper is to show that these different measures can be viewed as special cases of a generic similarity measure introduced in [8]. This generic similarity ...
متن کاملMultilevel Reactive Tabu Search for Graph Partitioning
In this paper, new multilevel heuristics are proposed for nding a balanced bipartition of a graph. Multilevel schemes have been recently introduced for quickly solving the problem on graphs with thousands of nodes, graphs often present in domain-decomposition techniques for parallel computing. These heuristics rstly reduce the original graph by collapsing its nodes and arcs, thus generating a h...
متن کاملPosition-Guided Tabu Search Algorithm for the Graph Coloring Problem
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. While there are many wellstudied methods to help the search process escape a basin of attraction, it seems more difficult to prevent it from looping between a limited number of basins of attraction. We introduce a Positi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Asia-Pacific Journal of Operational Research
سال: 2013
ISSN: 0217-5959,1793-7019
DOI: 10.1142/s0217595913500103